public class Text4 {
    // 路径总数
    public int uniquePaths (int m, int n) {
        // write code here
        int[][] dp = new int[m][n];
        for(int i = 0; i < m ;i++){
            for(int j = 0; j < n; j++){
                if(j == 0 || i == 0){
                    dp[i][j] = 1;
                    continue;
                }

                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }

        return dp[m-1][n-1];
    }
}
